Conditional observability

نویسنده

  • Miloslav Znojil
چکیده

For a quantum Hamiltonian H = H(λ), the observability of the energies E may be robust (whenever all E are real at all λ) or, otherwise, conditional. Using a pseudoHermitian family of N−state chain models H = H(λ) we discuss some generic properties of conditionally observable spectra.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on Relative Observability in Coordination Control

Relative observability has been introduced and studied in the framework of partially observed discrete-event systems as a condition stronger than observability, but weaker than normality. However, unlike observability, relative observability is closed under language unions, which makes it interesting for practical applications. In this paper, we investigate this notion in the framework of coord...

متن کامل

Complexity of Planning with Partial Observability

We show that for conditional planning with partial observability the existence problem of plans with success probability 1.0 is 2-EXP-complete. This result completes the complexity picture for nonprobabilistic propositional planning. We also give new more direct and informative proofs for the EXP-hardness of conditional planning with full observability and the EXPSPACE-hardness of conditional p...

متن کامل

A Logic for Planning under Partial Observability

We propose an epistemic dynamic logic EDL able to represent the interactions between action and knowledge that are fundamental to planning under partial observability. EDL enables us to represent incomplete knowledge, nondeterministic actions, observations, sensing actions and conditional plans; it also enables a logical expression of several frequently made assumptions about the nature of the ...

متن کامل

Conditional Planning under Partial Observability as Heuristic-Symbolic Search in Belief Space

Planning under partial observability in nondeterministic domains is a very significant and challenging problem, which requires dealing with uncertainty together with and-or search. In this paper, we propose a new algorithm for tackling this problem, able to generate conditional plans that are guaranteed to achieve the goal despite of the uncertainty in the initial condition and the uncertain ef...

متن کامل

Computing Contingent Plans via Fully Observable Non-Deterministic Planning

Planning with sensing actions under partial observability is a computationally challenging problem that is fundamental to the realization of AI tasks in areas as diverse as robotics, game playing, and diagnostic problem solving. Recent work on generating plans for partially observable domains has advocated for online planning, claiming that offline plans are often too large to generate. Here we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008